10 research outputs found
Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
The most prominent formal criterion for secure compilation is full
abstraction, the preservation and reflection of contextual equivalence. Recent
work introduced robust compilation, defined as the preservation of robust
satisfaction of hyperproperties, i.e., their satisfaction against arbitrary
attackers. In this paper, we initially set out to compare these two approaches
to secure compilation. To that end, we provide an exact description of the
hyperproperties that are robustly satisfied by programs compiled with a fully
abstract compiler, and show that they can be meaningless or trivial. We then
propose a novel criterion for secure compilation formulated in the framework of
Mathematical Operational Semantics (MOS), guaranteeing both full abstraction
and the preservation of robust satisfaction of hyperproperties in a more
sensible manner
CapablePtrs: Securely Compiling Partial Programs using the Pointers-as-Capabilities Principle
Capability machines such as CHERI provide memory capabilities that can be
used by compilers to provide security benefits for compiled code (e.g., memory
safety). The C to CHERI compiler, for example, achieves memory safety by
following a principle called "pointers as capabilities" (PAC). Informally, PAC
says that a compiler should represent a source language pointer as a machine
code capability. But the security properties of PAC compilers are not yet well
understood. We show that memory safety is only one aspect, and that PAC
compilers can provide significant additional security guarantees for partial
programs: the compiler can provide guarantees for a compilation unit, even if
that compilation unit is later linked to attacker-controlled machine code. This
paper is the first to study the security of PAC compilers for partial programs
formally. We prove for a model of such a compiler that it is fully abstract.
The proof uses a novel proof technique (dubbed TrICL, read trickle), which is
of broad interest because it reuses and extends the compiler correctness
relation in a natural way, as we demonstrate. We implement our compiler on top
of the CHERI platform and show that it can compile legacy C code with minimal
code changes. We provide performance benchmarks that show how performance
overhead is proportional to the number of cross-compilation-unit function
calls
A Study on Indoor Noise Levels in a Set of School Buildings in Greece utilizing an IoT infrastructure
Monitoring noise pollution in urban areas in a more systematic manner has
been gaining traction as a theme among the research community, especially with
the rise of smart cities and the IoT. However, although it affects our everyday
life in a profound way, monitoring indoor noise levels inside workplaces and
public buildings has so far grabbed less of our attention. In this work, we
report on noise levels data produced by an IoT infrastructure installed inside
5 school buildings in Greece. Our results indicate that such data can help to
produce a more accurate picture of the conditions that students and educators
experience every day, and also provide useful insights in terms of health risks
and aural comfort.Comment: Preprint submitted to the WSACC 2023 workshop, organized in the scope
of the 9th IEEE International Smart Cities Conference 202
Weak Similarity in Higher-Order Mathematical Operational Semantics
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's
framework of Mathematical Operational Semantics to higher-order languages. The
fundamental well-behavedness property of all specifications within the
framework is that coalgebraic strong (bi)similarity on their operational model
is a congruence. In the present work, we establish a corresponding congruence
theorem for weak similarity, which is shown to instantiate to well-known
concepts such as Abramsky's applicative similarity for the lambda-calculus. On
the way, we develop several techniques of independent interest at the level of
abstract categories, including relation liftings of mixed-variance bifunctors
and higher-order GSOS laws, as well as Howe's method
Abstract Congruence Criteria for Weak Bisimilarity
We introduce three general compositionality criteria over operational
semantics and prove that, when all three are satisfied together, they guarantee
weak bisimulation being a congruence. Our work is founded upon Turi and
Plotkin's mathematical operational semantics and the coalgebraic approach to
weak bisimulation by Brengos. We demonstrate each criterion with various
examples of success and failure and establish a formal connection with the
simply WB cool rule format of Bloom and van Glabbeek. In addition, we show that
the three criteria induce lax models in the sense of Bonchi et al
Stateful Structural Operational Semantics
Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees compositionality, but seen from the point of view of stateful computation it applies only to very fine-grained equivalences that essentially assume unrestricted interference by the environment between any two statements. We introduce the more restrictive stateful SOS rule format for stateful languages. We show that compositionality of two more coarse-grained semantics, respectively given by assuming read-only interference or no interference between steps, remains an undecidable property even for stateful SOS. However, further restricting the rule format in a manner inspired by the cool GSOS formats of Bloom and van Glabbeek, we obtain the streamlined and cool stateful SOS formats, which respectively guarantee compositionality of the two more abstract equivalences
CRDTs, Coalgebraically (Early Ideas)
We describe ongoing work that models conflict-free replicated data types (CRDTs) from a coalgebraic point of view. CRDTs are data structures designed for replication across multiple physical locations in a distributed system. We show how to model a CRDT at the local replica level using a novel coalgebraic semantics for CRDTs. We believe this is the first step towards presenting a unified theory for specifying and verifying CRDTs and replicated state machines. As a case study, we consider emulation of CRDTs in terms of coalgebra
Stateful Structural Operational Semantics
Compositionality of denotational semantics is an important concern in
programming semantics. Mathematical operational semantics in the sense of Turi
and Plotkin guarantees compositionality, but seen from the point of view of
stateful computation it applies only to very fine-grained equivalences that
essentially assume unrestricted interference by the environment between any two
statements. We introduce the more restrictive stateful SOS rule format for
stateful languages. We show that compositionality of two more coarse-grained
semantics, respectively given by assuming read-only interference or no
interference between steps, remains an undecidable property even for stateful
SOS. However, further restricting the rule format in a manner inspired by the
cool GSOS formats of Bloom and van Glabbeek, we obtain the streamlined and cool
stateful SOS formats, which respectively guarantee compositionality of the two
more abstract equivalences